ON A REDUCING OPERATOR FOR COMBINATORIAL SYSTEMS.KUDLEK M; NOVOTNY M.1978; INFORM. AND CONTROL; U.S.A.; DA. 1978; VOL. 37; NO 2; PP. 197-206; BIBL. 4 REF.Article

Comparison of basic language generating devices (non-deterministic systems)KUDLEK, M.Informatique théorique et applications (Imprimé). 1990, Vol 24, Num 5, pp 489-508, issn 0988-3754, 20 p.Article

Homomorphic images of sentential form languages defined by semi-Thue systemsJANTZEN, M; KUDLEK, M.Theoretical computer science. 1984, Vol 33, Num 1, pp 13-43, issn 0304-3975Article

Dyck₁-reductions of context-free languagesJANTZEN, M; KUDLEK, M; PETERSEN, H et al.Computers and artificial intelligence. 1990, Vol 9, Num 1, pp 3-18, issn 0232-0274, 16 p.Article

Strong iteration lemmata for regular, linear, context-free, and linear indexed languagesDÖMÖSI, P; KUDLEK, M.Lecture notes in computer science. 1999, pp 226-233, issn 0302-9743, isbn 3-540-66412-2Conference Paper

Contexts and the concept of mild context-sensitivity = Les contextes et le concept de légère sensibilité au contexteKUDLEK, M; MARTIN-VIDE, C; MATEESCU, A et al.Linguistics and philosophy. 2003, Vol 26, Num 6, pp 703-725, issn 0165-0157, 23 p.Article

Contextual grammars with distributed catenation and shuffleKUDLEK, M; MARCUS, S; MATEESCU, A et al.Lecture notes in computer science. 1997, pp 269-280, issn 0302-9743, isbn 3-540-63386-3Conference Paper